Sacrificio cortoplacista adaptativo en comparación con metaheurísticas para el TSP

─ We present two new heuristics for the TSP symmetric: the sacrifice short-term adaptive 2-opt (SCA_2opt) and an improved version (SCA_2_opt_r). These methods are the result of systemic analysis of the decision rule nearest neighbor, to which he was found on systems archetype “Solutions counterproductive.” The SCA is based on the traveler used in the TSP, resign at any time to overnight stop near the city immediately, and moved to the second city nearest available. From this change, the traveler continues with the nearest neighbor rule. Each SCA is performed (global search) a local search is performed 2_opt. The two heuristics reflect a good performance in efficiency and effectiveness in comparison with various metaheuristics in the categories of ant colonies, genetic algorithms, simulated annealing and other. Emerging questions are provided that enable a greater understanding and improvement of the study. These questions are also invited to continue integrating elements of clasic optimization with systems thinking.